Permutational genetic algorithm for the optimized mapping and scheduling of tasks and messages in distributed real-time systems
نویسندگان
چکیده
The mapping of tasks and messages and the assignment of fixed priorities in distributed real-time systems are known to be NP-hard problems, and thus there are no optimal methods to accomplish them in polynomial time. This fact makes them suitable problems to be approached with generic search and optimization algorithms. In this paper we propose a genetic algorithm with a permutational solution encoding, which apart from solving the mapping and the fixed priority assignment problems using a holistic approach, can simultaneously minimize the average use of computing, memory and communication resources, the average worstcase response time of the transactions and the number of the used processors. The experimental results show that this genetic algorithm can find good solutions for industrial size distributed real-time architectures and in reasonable times from the perspective of a complex system design process. Keywords-distributed real-time; holistic; mapping; scheduling; priority assignment; genetic algorithm; linear programming
منابع مشابه
Permutational genetic algorithm for fixed priority scheduling of distributed real-time systems aided by network segmentation
The fixed priority scheduling of distributed realtime systems is an NP-hard problem, and therefore it is a suitable problem to be approached with generic search and optimization algorithms. On the other hand, the segmentation of the network can contribute positively to the schedulability of distributed real-time systems. This paper proposes a genetic algorithm with a permutational solution enco...
متن کاملGASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment
The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...
متن کاملGASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment
The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل